Exact Method with Dominance Rules for Solving Scheduling on a Single Machine Problem with Multiobjective Function

The present article proposes an exact algorithm for the single-machine scheduling problem to minimize sum of total completion times, range lateness and maximum tardiness on a single machine (1/ /(∑ C_(σ_j + R_L T_max)), where idle time is prohibited. In this paper, one multiobjective function criteria just being studied. To obtain optimal solution suggested problem, we propose use Branch Bound method (BAB) depending upon some dominance rules. This used new technique three upper bounds (UB) lower bound (LB). proposed BAB proved its sufficiency by practical results n ≤ 15 in reasonable time. Lastly, theorem as special case our problem.